dual algorithm

См. также в других словарях:

• Dual — may refer to: Dual (mathematics), a notion of paired concepts that mirror one another Dual (category theory), a formalization of mathematical duality . . . see more cases in Category:Duality theories Dual (grammatical number), a… …   Wikipedia

• Dual-tone multi-frequency — (DTMF) signaling is used for telephone signaling over the line in the voice frequency band to the call switching center. The version of DTMF used for telephone tone dialing is known by the trademarked term Touch Tone (canceled March 13, 1984),… …   Wikipedia

• Dual inheritance theory — (DIT), also known as gene culture coevolution, was developed in the late 1970s and early 1980s to explain how human behavior is a product of two different and interacting evolutionary processes: genetic evolution and cultural evolution. DIT is a… …   Wikipedia

• Diffusing update algorithm — DUAL, the Diffusing Update ALgorithm, is the algorithm used by Cisco s EIGRP routing protocol to ensure that a given route is recalculated globally whenever it might cause a routing loop. According to Cisco, the full name of the algorithm is DUAL …   Wikipedia

• Dual EC DRBG — is a controversial pseudorandom number generator (PRNG) designed and published by the National Security Agency. It is based on the elliptic curve discrete logarithm problem (ECDLP) and is one of the four PRNGs standardized in the NIST Special… …   Wikipedia

• Dual-tone multi-frequency signaling — One of the few production telephone DTMF keypads with all 16 keys, from an Autovon Telephone. The column of red keys produces the A, B, C, and D DTMF events. Dual tone multi frequency signaling (DTMF) is used for telecommunication signaling over… …   Wikipedia

• Dual — Der Begriff Dual (von lat. dualis „zwei enthaltend“) bezeichnet: Dualraum in der Linearen Algebra Dual (Grammatik), in der Grammatik die Zweizahl (neben Einzahl und Mehrzahl), Dualsystem, ein Zahlensystem in der Mathematik Dual (Unternehmen),… …   Deutsch Wikipedia

• Dual of BCH is an independent source — A certain family of BCH codes have a particularly useful property, which is that treated as linear operators, their dual operators turns their input into an wise independent source. That is, the set of vectors from the input vector space are… …   Wikipedia

• Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… …   Wikipedia

• Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… …   Wikipedia

• Bruun's FFT algorithm — Bruun s algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996 …   Wikipedia